Fractional Steepest Ascent Method for TCU Fault Detection
نویسندگان
چکیده
منابع مشابه
The steepest-ascent method for the linear programming problem
This paver deals with afinite projection method (called the steepest-ascent method) proposée in 1974 by one oj the authors for maximizing a hnear function on a polyhedron In the particular case of the maximizatwn of a piecewise-linear concave function the method simply gives a recently pubhshed algonthm stated in theframework of the nondifferentiable convex optimizatwn Résumé — Ce papier traite...
متن کاملSteepest Ascent Tariff Reforms
This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...
متن کاملSteepest Ascent for Large - Scale Linear Programs
Many structured large-scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints. The equivalent problem can, in turn, be solved in a finite number of steps using a steepest ascent algorithm. This principle is applied to block diagonal systems yielding refinements of existing algorithms. An app...
متن کاملA Modified Path of Steepest Ascent for Split-Plot Experiments
I NDUSTRIAL experiments often involve two types of factors: those that are hard to change and those that are easy to change. The experiments are performed by fixing the levels of the hard-to-change factors and then running all or some of the combinations of the easy-to-change factor levels. Then, a new setting in the hard-to-change factors is selected and the process is repeated. With replicati...
متن کاملSteepest Ascent Hill Climbing For A Mathematical Problem
The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer factorization, algebraic curves, projective curves and data dependency in super computers. Importantly, it has been proved that there is no general method to fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.09.561